Budgeted Thompson Sampling for IRS Enabled WiGig Relaying
نویسندگان
چکیده
Intelligent reconfigurable surface (IRS) is a competitive relaying technology to widen the WiGig coverage range, as it offers an effective means of addressing blocking issues. However, selecting optimal IRS relay for maximum attainable data rate time-consuming process, requires beamforming training (BT) tune phase shifts (PSs) base station (WGBS) and relays. This paper proposes self-learning-based budgeted Thomson sampling approach probing (BTS-IRS) address this challenge. The BT time cost incorporated into main BTS formula, where both payoff posterior distributions are sampled separately, their ratio estimated, arm/IRS with highest decided. enables be chosen lowest cost. Numerical results demonstrate improved performance BTS-IRS technique regarding consumption/cost, spectral efficiency, when compared other benchmarks.
منابع مشابه
Thompson Sampling for Budgeted Multi-Armed Bandits
Thompson sampling is one of the earliest randomized algorithms for multi-armed bandits (MAB). In this paper, we extend the Thompson sampling to Budgeted MAB, where there is random cost for pulling an arm and the total cost is constrained by a budget. We start with the case of Bernoulli bandits, in which the random rewards (costs) of an arm are independently sampled from a Bernoulli distribution...
متن کاملThompson Sampling for Dynamic Pricing
In this paper we apply active learning algorithms for dynamic pricing in a prominent e-commerce website. Dynamic pricing involves changing the price of items on a regular basis, and uses the feedback from the pricing decisions to update prices of the items. Most popular approaches to dynamic pricing use a passive learning approach, where the algorithm uses historical data to learn various param...
متن کاملFreshness-Aware Thompson Sampling
To follow the dynamicity of the user’s content, researchers have recently started to model interactions between users and the ContextAware Recommender Systems (CARS) as a bandit problem where the system needs to deal with exploration and exploitation dilemma. In this sense, we propose to study the freshness of the user’s content in CARS through the bandit problem. We introduce in this paper an ...
متن کاملSpectral Thompson Sampling
Thompson Sampling (TS) has surged a lot of interest due to its good empirical performance, in particular in the computational advertising. Though successful, the tools for its performance analysis appeared only recently. In this paper, we describe and analyze SpectralTS algorithm for a bandit problem, where the payoffs of the choices are smooth given an underlying graph. In this setting, each c...
متن کاملLinear Thompson Sampling Revisited
We derive an alternative proof for the regret of Thompson sampling (TS) in the stochastic linear bandit setting. While we obtain a regret bound of order e O(d3/2 p T ) as in previous results, the proof sheds new light on the functioning of the TS. We leverage on the structure of the problem to show how the regret is related to the sensitivity (i.e., the gradient) of the objective function and h...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronics
سال: 2023
ISSN: ['2079-9292']
DOI: https://doi.org/10.3390/electronics12051146